The Isotron Algorithm: High-Dimensional Isotonic Regression
نویسندگان
چکیده
The Perceptron algorithm elegantly solves binary classification problems that have a margin between positive and negative examples. Isotonic regression (fitting an arbitrary increasing function in one dimension) is also a natural problem with a simple solution. By combining the two, we get a new but very simple algorithm with strong guarantees. Our ISOTRON algorithm provably learns Single Index Models (SIM), a generalization of linear and logistic regression, generalized linear models, as well as binary classification by linear threshold functions. In particular, it provably learns SIMs with unknown mean functions that are nondecreasing and Lipschitz-continuous, thereby generalizing linear and logistic regression and linear-threshold functions (with a margin). Like the Perceptron, it is straightforward to implement and kernelize. Hence, the ISOTRON provides a very simple yet flexible and principled approach to regression.
منابع مشابه
LASSO ISOtone for High Dimensional Additive Isotonic Regression
Additive isotonic regression attempts to determine the relationship between a multi-dimensional observation variable and a response, under the constraint that the estimate is the additive sum of univariate component effects that are monotonically increasing. In this article, we present a new method for such regression called LASSO Isotone (LISO). LISO adapts ideas from sparse linear modelling t...
متن کاملIsotonic single-index model for high-dimensional database marketing
While database marketers collect vast amounts of customer transaction data, its utilization to improve marketing decisions presents problems. Marketers seek to extract relevant information from large databases by identifying signi6cant variables and prospective customers. In small databases, they could calibrate logistic regression models via maximum-likelihood methods to determine signi6cant v...
متن کاملL infinity Isotonic Regression for Linear, Multidimensional, and Tree Orders
Algorithms are given for determining L∞ isotonic regression of weighted data where the independent set is n vertices in multidimensional space or in a rooted tree. For a linear order, or, more generally, a grid in multidimensional space, an optimal algorithm is given, taking Θ(n) time. For vertices at arbitrary locations in d-dimensional space a Θ(n log n) algorithm employs iterative sorting to...
متن کاملL∞ Isotonic Regression for Linear, Multidimensional, and Tree Orders
Algorithms are given for determining L∞ isotonic regression of weighted data. For a linear order, grid in multidimensional space, or tree, of n vertices, optimal algorithms are given, taking Θ(n) time. These improve upon previous algorithms by a factor of Ω(log n). For vertices at arbitrary positions in d-dimensional space a Θ(n log n) algorithm employs iterative sorting to yield the functional...
متن کاملRobust high-dimensional semiparametric regression using optimized differencing method applied to the vitamin B2 production data
Background and purpose: By evolving science, knowledge, and technology, we deal with high-dimensional data in which the number of predictors may considerably exceed the sample size. The main problems with high-dimensional data are the estimation of the coefficients and interpretation. For high-dimension problems, classical methods are not reliable because of a large number of predictor variable...
متن کامل